Using Graph Based Method to Improve Bootstrapping Relation Extraction
نویسندگان
چکیده
Many bootstrapping relation extraction systems processing large corpus or working on the Web have been proposed in the literature. These systems usually return a large amount of extracted relationship instances as an out-ofordered set. However, the returned result set often contains many irrelevant or weakly related instances. Ordering the extracted examples by their relevance to the given seeds is helpful to filter out irrelevant instances. Furthermore, ranking the extracted examples makes the selection of most similar instance easier. In this paper, we use a graph based method to rank the returned relation instances of a bootstrapping relation extraction system. We compare the used algorithm to the existing methods, relevant score based methods and frequency based methods, the results indicate that the proposed algorithm can improve the performance of the bootstrapping relation extraction systems.
منابع مشابه
Graph-Based Seed Set Expansion for Relation Extraction Using Random Walk Hitting Times
Iterative bootstrapping methods are widely employed for relation extraction, especially because they require only a small amount of human supervision. Unfortunately, a phenomenon known as semantic drift can affect the accuracy of iterative bootstrapping and lead to poor extractions. This paper proposes an alternative bootstrapping method, which ranks relation tuples by measuring their distance ...
متن کاملExpanding The Recall Of Relation Extraction By Bootstrapping
Most works on relation extraction assume considerable human effort for making an annotated corpus or for knowledge engineering. Generic patterns employed in KnowItAll achieve unsupervised, highprecision extraction, but often result in low recall. This paper compares two bootstrapping methods to expand recall that start with automatically extracted seeds by KnowItAll. The first method is string ...
متن کاملTuple Refinement Method Based on Relationship Keyword Extension
Entity relation extraction is mainly focused on researching extraction approaches and improving precision of the extraction results. Although many efforts have been made on this field, there still exist some problems. In order to improve the performance of extracting entity relation, we propose a tuple refinement method based on relationship keyword extension. Firstly, we utilize the diversity ...
متن کاملRelation Extraction Using Label Propagation Based Semi-Supervised Learning
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label propagation (LP) algorithm, for relation extraction. It represents labeled and unlabeled examples and their distances as the nodes and the weights of edges of a graph, and tries to obtain a labeling function to satisfy...
متن کاملSemi-supervised Relation Extraction with Label Propagation
To overcome the problem of not having enough manually labeled relation instances for supervised relation extraction methods, in this paper we propose a label propagation (LP) based semi-supervised learning algorithm for relation extraction task to learn from both labeled and unlabeled data. Evaluation on the ACE corpus showed when only a few labeled examples are available, our LP based relation...
متن کامل